Optimal path cover problem on block graphs
نویسندگان
چکیده
منابع مشابه
Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs
The optimal path cover problem is to find a minimum number of vertex disjoint paths which together cover all the vertices of the graph. Finding an optimal path cover for an arbitrary graph is known to be NP-complete [3]. However, polynornial-time algorithms exist for trees [4], cacti [4] and for interval graphs [9]. The solution presented in [2] For circular-arc graphs is known to be wrong. In ...
متن کاملAn optimal parallel solution for the path cover problem on P4-sparse graphs
Nakano et al. in [20] presented a timeand work-optimal algorithm for finding the smallest number of vertex-disjoint paths that cover the vertices of a cograph and left open the problem of applying their technique into other classes of graphs. Motivated by this issue we generalize their technique and apply it to the class of P4-sparse graphs, which forms a proper superclass of cographs. We show ...
متن کاملA Linear-Time Algorithm for the Terminal Path Cover Problem in Block Graphs
In this paper, we study a variant of the path cover problem, namely, the terminal path cover problem. Given a graph G and a subset T of vertices of G, a terminal path cover of G with respect to T is a set of pairwise vertex-disjoint paths PC that covers the vertices of G such that the vertices of T are all endpoints of the paths in PC. The terminal path cover problem is to find a terminal path ...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملCorrigendum to "The path-partition problem in block graphs"
Recently, Wong [1] pointed out that Yan and Chang’s [2] linear-time algorithm for the path-partition problem for block graphs is not correct, by giving the following example. Suppose G is the graph consisting of a vertex w and a set of triangles {xi, yi, zi} such that each xi is adjacent to w for 1 i k, where k 3. Then p(G) = k − 1, but Yan and Chang’s algorithm gives p(G)= 1. He also traced th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00180-7